On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees
نویسندگان
چکیده
This paper addresses the informational asymmetry for con structing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given species We show that the tallest ultrametric tree exists and can be constructed in O n time while the existence of the shortest ultrametric tree depends on whether the lower bounds are ultrametric The tallest tree construction algorithm gives a very simple solution to the construction of an ultrametric tree We also provide an e cient O n time algorithm for checking the uniqueness of an ultrametric tree and study a query problem for testing whether an ultrametric tree satis es both upper and lower bounds
منابع مشابه
An Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملBalanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient construction of evolutionary trees: a new upper time-bound on the problem of constructing an evolutionary tree from experiments, and a relatively fast approximation algorithm for the maximum agreement subtree problem ...
متن کاملChemical Trees with Extreme Values of Zagreb Indices and Coindices
We give sharp upper bounds on the Zagreb indices and lower bounds on the Zagreb coindices of chemical trees and characterize the case of equality for each of these topological invariants.
متن کاملOn the Multiplicative Zagreb Indices of Bucket Recursive Trees
Bucket recursive trees are an interesting and natural generalization of ordinary recursive trees and have a connection to mathematical chemistry. In this paper, we give the lower and upper bounds for the moment generating function and moments of the multiplicative Zagreb indices in a randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$. Also, we consi...
متن کاملThe Ultrametric Constraint and its Application to Phylogenetics
A phylogenetic tree shows the evolutionary relationships among existing species. Internal nodes of the tree represent speciation events and leaf nodes correspond to existing species. A goals of phylogenetics is to combine such trees into larger trees, called supertrees, whilst respecting the relationships in the original trees. A rooted tree exhibits an ultrametric property; that is, for any th...
متن کامل